Parametric Critical Path Analysis for Event Networks With Minimal and Maximal Time Lags
نویسندگان
چکیده
منابع مشابه
MILP models and valid inequalities for the two-machine permutation flowshop scheduling problem with minimal time lags
In this paper, we consider the problem of scheduling on two-machine permutation flowshop with minimal time lags between consecutive operations of each job. The aim is to find a feasible schedule that minimizes the total tardiness. This problem is known to be NP-hard in the strong sense. We propose two mixed-integer linear programming (MILP) models and two types of valid inequalities which aim t...
متن کاملMaximal and Minimal Vertex - critical Graphsof Diameter
A graph is vertex-critical (edge-critical) if deleting any vertex (edge) increases its diameter. A conjecture of Simon and Murty stated thatèvery edge-critical graph of diameter two on vertices contains at most 1 4 2 edges'. This conjecture has been established for suuciently large. For vertex-critical graphs, little is known about the number of edges. Plesn ik implicitly asked whether it is al...
متن کاملA Practical and Robust Execution Time-Frame Procedure for the Multi-Mode Resource-Constrained Project Scheduling Problem with Minimal and Maximal Time Lags
Modeling and optimizing organizational processes, such as the one represented by the Resource-Constrained Project Scheduling Problem (RCPSP), improve outcomes. Based on assumptions and simplification, this model tackles the allocation of resources so that organizations can continue to generate profits and reinvest in future growth. Nonetheless, despite all of the research dedicated to solving t...
متن کاملOn Critical Path Analysis of Parallel Discrete Event Simulations
Several protocols have been proposed to synchronize the logical processes (LP’s) of a parallel discrete event simulation (PDES). While most protocols have been known to perform well under certain conditions, the general observation has been that the performance of protocols is sensitive to the application being simulated, sometimes even to a particular instance of it. In this technical note, we...
متن کاملJob Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach
In previous work we introduced a simple constraint model that combined generic AI strategies and techniques (weighted degree heuristic, geometric restarts, nogood learning from restarts) with naive propagation for job shop and open shop scheduling problems. Here, we extend our model to handle two variants of the job shop scheduling problem: job shop problems with setup times; and job shop probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
سال: 2018
ISSN: 0278-0070,1937-4151
DOI: 10.1109/tcad.2018.2857360